Partnership games with secret signals prohibited.
نویسندگان
چکیده
منابع مشابه
Secret Sharing in Graph-Based Prohibited Structures
A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we...
متن کاملSecret Sharing Schemes for Graph-Based Prohibited Structures
K e y w o r d s C r y p t o g r a p h y , Data security, Information theory, Secret sharing scheme. 1 . I N T R O D U C T I O N In 1987, I to et al. [1] desc r ibed a genera l m e t h o d of secret shar ing cal led Secret Sharing Scheme (SSS) which allows a m a s t e r key to be sha red among a finite set of p a r t i c i p a n t s in such a way t h a t on ly ce r ta in prespecif ied subse ts o...
متن کاملRepeated Games with Frequent Signals
We study repeated games with frequent actions and frequent imperfect public signals, where the signals are the aggregate of many discrete events, such as sales or tasks. The high-frequency limit of the equilibrium set depends on both the probability law governing the discrete events and on how many events are aggregated into a single signal. When the underlying events have a binomial distributi...
متن کاملRepeated Partnership Games with Imperfect Monitoring and No Discounting
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملA Skilled Secret Sharing Scheme for r-Uniform Hypergraph-Based Prohibited Structures
Secret sharing is that a dealer distributes a piece of information (called a share) about a secret to each participant such that authorized subsets of participants can reconstruct the secret but unauthorized subsets of participants cannot determine the secret. If any unauthorized subset of participants can not obtain any more information regarding the secret, then the scheme is called perfect. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1961
ISSN: 0026-2285
DOI: 10.1307/mmj/1028998518